0.07/0.12	% Problem    : Vampire---4.8_26065 : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer : n019.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1440
0.13/0.34	% WCLimit    : 180
0.13/0.34	% DateTime   : Mon Jul  3 12:59:04 EDT 2023
0.13/0.35	% CPUTime    : 
0.20/0.47	Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.aR0XUU7mDn/Vampire---4.8_26065
0.20/0.48	# Version: 3.1pre001-ho
0.20/0.49	# Preprocessing class: HSSSSLSSSLMNSSN.
0.20/0.49	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.49	# Starting full_lambda_10 with 900s (5) cores
0.20/0.49	# Starting lpo4_fix with 180s (1) cores
0.20/0.49	# Starting new_bool_6 with 180s (1) cores
0.20/0.49	# Starting lpo8_s with 180s (1) cores
0.20/0.49	# full_lambda_10 with pid 26243 completed with status 0
0.20/0.49	# Result found by full_lambda_10
0.20/0.49	# Preprocessing class: HSSSSLSSSLMNSSN.
0.20/0.49	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.49	# Starting full_lambda_10 with 900s (5) cores
0.20/0.49	# SinE strategy is GSinE(CountFormulas,hypos,5,,5,20000,3.0,true)
0.20/0.49	# Search class: HHHSF-FFSF22-MSSFMFNN
0.20/0.49	# partial match(3): HHUSF-FFSF22-SSSFFFNN
0.20/0.49	# Scheduled 6 strats onto 5 cores with 900 seconds (900 total)
0.20/0.49	# Starting new_ho_10 with 487s (1) cores
0.20/0.49	# Starting full_lambda_10 with 91s (1) cores
0.20/0.49	# Starting new_bool_1 with 82s (1) cores
0.20/0.49	# Starting new_bool_2 with 82s (1) cores
0.20/0.49	# Starting new_bool_9 with 82s (1) cores
0.20/0.49	# new_ho_10 with pid 26247 completed with status 9
0.20/0.49	# Starting sh5l with 76s (1) cores
0.20/0.49	# full_lambda_10 with pid 26248 completed with status 0
0.20/0.49	# Result found by full_lambda_10
0.20/0.49	# Preprocessing class: HSSSSLSSSLMNSSN.
0.20/0.49	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.49	# Starting full_lambda_10 with 900s (5) cores
0.20/0.49	# SinE strategy is GSinE(CountFormulas,hypos,5,,5,20000,3.0,true)
0.20/0.49	# Search class: HHHSF-FFSF22-MSSFMFNN
0.20/0.49	# partial match(3): HHUSF-FFSF22-SSSFFFNN
0.20/0.49	# Scheduled 6 strats onto 5 cores with 900 seconds (900 total)
0.20/0.49	# Starting new_ho_10 with 487s (1) cores
0.20/0.49	# Starting full_lambda_10 with 91s (1) cores
0.20/0.49	# Preprocessing time       : 0.001 s
0.20/0.49	# Presaturation interreduction done
0.20/0.49	
0.20/0.49	# Proof found!
0.20/0.49	# SZS status Theorem
0.20/0.49	# SZS output start CNFRefutation
0.20/0.49	thf(decl_22, type, in: $i > $i > $o).
0.20/0.49	thf(decl_23, type, emptyset: $i).
0.20/0.49	thf(decl_24, type, setadjoin: $i > $i > $i).
0.20/0.49	thf(decl_25, type, dsetconstr: $i > ($i > $o) > $i).
0.20/0.49	thf(decl_26, type, singleton: $i > $o).
0.20/0.49	thf(decl_27, type, iffalseProp1: $o).
0.20/0.49	thf(decl_28, type, iffalseProp2: $o).
0.20/0.49	thf(decl_29, type, iftrueProp1: $o).
0.20/0.49	thf(decl_30, type, iftrueProp2: $o).
0.20/0.49	thf(decl_31, type, esk1_0: $i).
0.20/0.49	thf(decl_32, type, epred1_0: $o).
0.20/0.49	thf(decl_33, type, esk2_0: $i).
0.20/0.49	thf(decl_34, type, esk3_0: $i).
0.20/0.49	thf(decl_39, type, esk8_1: $i > $i).
0.20/0.49	thf(singleton, axiom, ((singleton)=(^[X1:$i]:(?[X2:$i]:(((in @ X2 @ X1)&((X1)=(setadjoin @ X2 @ emptyset))))))), file('/export/starexec/sandbox/tmp/tmp.aR0XUU7mDn/Vampire---4.8_26065', singleton)).
0.20/0.49	thf(iftrueProp2, axiom, ((iftrueProp2)<=>![X1:$i, X3:$o, X2:$i]:(((in @ X2 @ X1)=>![X4:$i]:(((in @ X4 @ X1)=>((X3)=>((dsetconstr @ X1 @ (^[X5:$i]:((((X3)&((X5)=(X2)))|(~((X3))&((X5)=(X4)))))))=(setadjoin @ X2 @ emptyset)))))))), file('/export/starexec/sandbox/tmp/tmp.aR0XUU7mDn/Vampire---4.8_26065', iftrueProp2)).
0.20/0.49	thf(iftrueProp1, axiom, ((iftrueProp1)<=>![X1:$i, X3:$o, X2:$i]:(((in @ X2 @ X1)=>![X4:$i]:(((in @ X4 @ X1)=>((X3)=>(in @ X2 @ (dsetconstr @ X1 @ (^[X5:$i]:((((X3)&((X5)=(X2)))|(~((X3))&((X5)=(X4)))))))))))))), file('/export/starexec/sandbox/tmp/tmp.aR0XUU7mDn/Vampire---4.8_26065', iftrueProp1)).
0.20/0.49	thf(iffalseProp2, axiom, ((iffalseProp2)<=>![X1:$i, X3:$o, X2:$i]:(((in @ X2 @ X1)=>![X4:$i]:(((in @ X4 @ X1)=>(~((X3))=>((dsetconstr @ X1 @ (^[X5:$i]:((((X3)&((X5)=(X2)))|(~((X3))&((X5)=(X4)))))))=(setadjoin @ X4 @ emptyset)))))))), file('/export/starexec/sandbox/tmp/tmp.aR0XUU7mDn/Vampire---4.8_26065', iffalseProp2)).
0.20/0.49	thf(iffalseProp1, axiom, ((iffalseProp1)<=>![X1:$i, X3:$o, X2:$i]:(((in @ X2 @ X1)=>![X4:$i]:(((in @ X4 @ X1)=>(~((X3))=>(in @ X4 @ (dsetconstr @ X1 @ (^[X5:$i]:((((X3)&((X5)=(X2)))|(~((X3))&((X5)=(X4)))))))))))))), file('/export/starexec/sandbox/tmp/tmp.aR0XUU7mDn/Vampire---4.8_26065', iffalseProp1)).
0.20/0.49	thf(ifSingleton, conjecture, ((iffalseProp1)=>((iffalseProp2)=>((iftrueProp1)=>((iftrueProp2)=>![X1:$i, X3:$o, X2:$i]:(((in @ X2 @ X1)=>![X4:$i]:(((in @ X4 @ X1)=>(singleton @ (dsetconstr @ X1 @ (^[X5:$i]:(((~((X3))&((X5)=(X4)))|(((X5)=(X2))&(X3))))))))))))))), file('/export/starexec/sandbox/tmp/tmp.aR0XUU7mDn/Vampire---4.8_26065', ifSingleton)).
0.20/0.49	thf(c_0_6, plain, ((singleton)=(^[Z0/* 5 */:$i]:(?[X2:$i]:(((in @ X2 @ Z0)&((Z0)=(setadjoin @ X2 @ emptyset))))))), inference(fof_simplification,[status(thm)],[singleton])).
0.20/0.49	thf(c_0_7, plain, ((iftrueProp2)<=>![X1:$i, X3:$o, X2:$i]:(((in @ X2 @ X1)=>![X4:$i]:(((in @ X4 @ X1)=>((X3)=>((dsetconstr @ X1 @ (^[Z0/* 9 */:$i]:((((X3)&((Z0)=(X2)))|(~((X3))&((Z0)=(X4)))))))=(setadjoin @ X2 @ emptyset)))))))), inference(fof_simplification,[status(thm)],[iftrueProp2])).
0.20/0.49	thf(c_0_8, plain, ((iftrueProp1)<=>![X1:$i, X3:$o, X2:$i]:(((in @ X2 @ X1)=>![X4:$i]:(((in @ X4 @ X1)=>((X3)=>(in @ X2 @ (dsetconstr @ X1 @ (^[Z0/* 9 */:$i]:((((X3)&((Z0)=(X2)))|(~((X3))&((Z0)=(X4)))))))))))))), inference(fof_simplification,[status(thm)],[iftrueProp1])).
0.20/0.49	thf(c_0_9, plain, ((iffalseProp2)<=>![X1:$i, X3:$o, X2:$i]:(((in @ X2 @ X1)=>![X4:$i]:(((in @ X4 @ X1)=>(~((X3))=>((dsetconstr @ X1 @ (^[Z0/* 9 */:$i]:((((X3)&((Z0)=(X2)))|(~((X3))&((Z0)=(X4)))))))=(setadjoin @ X4 @ emptyset)))))))), inference(fof_simplification,[status(thm)],[iffalseProp2])).
0.20/0.49	thf(c_0_10, plain, ((iffalseProp1)<=>![X1:$i, X3:$o, X2:$i]:(((in @ X2 @ X1)=>![X4:$i]:(((in @ X4 @ X1)=>(~((X3))=>(in @ X4 @ (dsetconstr @ X1 @ (^[Z0/* 9 */:$i]:((((X3)&((Z0)=(X2)))|(~((X3))&((Z0)=(X4)))))))))))))), inference(fof_simplification,[status(thm)],[iffalseProp1])).
0.20/0.49	thf(c_0_11, negated_conjecture, ~((![X26:$i, X27:$o, X28:$i]:(((in @ X28 @ X26)=>![X29:$i]:(((in @ X29 @ X26)=>(~(X27)=>(in @ X29 @ (dsetconstr @ X26 @ (^[Z0/* 9 */:$i]:((((X27)&((Z0)=(X28)))|(~((X27))&((Z0)=(X29)))))))))))))=>(![X30:$i, X31:$o, X32:$i]:(((in @ X32 @ X30)=>![X33:$i]:(((in @ X33 @ X30)=>(~(X31)=>((dsetconstr @ X30 @ (^[Z0/* 9 */:$i]:((((X31)&((Z0)=(X32)))|(~((X31))&((Z0)=(X33)))))))=(setadjoin @ X33 @ emptyset)))))))=>(![X34:$i, X35:$o, X36:$i]:(((in @ X36 @ X34)=>![X37:$i]:(((in @ X37 @ X34)=>((X35)=>(in @ X36 @ (dsetconstr @ X34 @ (^[Z0/* 9 */:$i]:((((X35)&((Z0)=(X36)))|(~((X35))&((Z0)=(X37)))))))))))))=>(![X38:$i, X39:$o, X40:$i]:(((in @ X40 @ X38)=>![X41:$i]:(((in @ X41 @ X38)=>((X39)=>((dsetconstr @ X38 @ (^[Z0/* 9 */:$i]:((((X39)&((Z0)=(X40)))|(~((X39))&((Z0)=(X41)))))))=(setadjoin @ X40 @ emptyset)))))))=>![X1:$i, X3:$o, X2:$i]:(((in @ X2 @ X1)=>![X4:$i]:(((in @ X4 @ X1)=>?[X42:$i]:(((in @ X42 @ (dsetconstr @ X1 @ (^[Z0/* 9 */:$i]:(((~((X3))&((Z0)=(X4)))|(((Z0)=(X2))&(X3)))))))&((dsetconstr @ X1 @ (^[Z0/* 9 */:$i]:(((~((X3))&((Z0)=(X4)))|(((Z0)=(X2))&(X3))))))=(setadjoin @ X42 @ emptyset))))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[ifSingleton])]), c_0_6]), c_0_7]), c_0_8]), c_0_9]), c_0_10])])).
0.20/0.49	thf(c_0_12, negated_conjecture, ![X43:$i, X44:$o, X45:$i, X46:$i, X47:$i, X48:$o, X49:$i, X50:$i, X51:$i, X52:$o, X53:$i, X54:$i, X55:$i, X56:$o, X57:$i, X58:$i, X63:$i]:(((~(in @ X45 @ X43)|(~(in @ X46 @ X43)|((X44)|(in @ X46 @ (dsetconstr @ X43 @ (^[Z0/* 9 */:$i]:((((X44)&((Z0)=(X45)))|(~((X44))&((Z0)=(X46)))))))))))&((~(in @ X49 @ X47)|(~(in @ X50 @ X47)|((X48)|((dsetconstr @ X47 @ (^[Z0/* 9 */:$i]:((((X48)&((Z0)=(X49)))|(~((X48))&((Z0)=(X50)))))))=(setadjoin @ X50 @ emptyset)))))&((~(in @ X53 @ X51)|(~(in @ X54 @ X51)|(~(X52)|(in @ X53 @ (dsetconstr @ X51 @ (^[Z0/* 9 */:$i]:((((X52)&((Z0)=(X53)))|(~((X52))&((Z0)=(X54)))))))))))&((~(in @ X57 @ X55)|(~(in @ X58 @ X55)|(~(X56)|((dsetconstr @ X55 @ (^[Z0/* 9 */:$i]:((((X56)&((Z0)=(X57)))|(~((X56))&((Z0)=(X58)))))))=(setadjoin @ X57 @ emptyset)))))&((in @ esk2_0 @ esk1_0)&((in @ esk3_0 @ esk1_0)&(~(in @ X63 @ (dsetconstr @ esk1_0 @ (^[Z0/* 9 */:$i]:(((~((epred1_0))&((Z0)=(esk3_0)))|(((Z0)=(esk2_0))&(epred1_0)))))))|((dsetconstr @ esk1_0 @ (^[Z0/* 9 */:$i]:(((~((epred1_0))&((Z0)=(esk3_0)))|(((Z0)=(esk2_0))&(epred1_0))))))!=(setadjoin @ X63 @ emptyset)))))))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])).
0.20/0.49	thf(c_0_13, negated_conjecture, ![X1:$i, X4:$i, X2:$i]:((((dsetconstr @ X2 @ (^[Z0/* 9 */:$i]:(((($true)&((Z0)=(X1)))|(~(($true))&((Z0)=(X4)))))))=(setadjoin @ X1 @ emptyset))|~((in @ X1 @ X2))|~((in @ X4 @ X2)))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_12])])])).
0.20/0.49	thf(c_0_14, negated_conjecture, ![X4:$i, X2:$i, X1:$i]:((((dsetconstr @ X1 @ (^[Z0/* 3 */:$i]:(((Z0)=(X2)))))=(setadjoin @ X2 @ emptyset))|~((in @ X4 @ X1))|~((in @ X2 @ X1)))), inference(cn,[status(thm)],[c_0_13])).
0.20/0.49	thf(c_0_15, negated_conjecture, ![X1:$i]:((~((in @ X1 @ (dsetconstr @ esk1_0 @ (^[Z0/* 9 */:$i]:(((~((epred1_0))&((Z0)=(esk3_0)))|(((Z0)=(esk2_0))&(epred1_0))))))))|((dsetconstr @ esk1_0 @ (^[Z0/* 9 */:$i]:(((~((epred1_0))&((Z0)=(esk3_0)))|(((Z0)=(esk2_0))&(epred1_0))))))!=(setadjoin @ X1 @ emptyset)))), inference(split_conjunct,[status(thm)],[c_0_12])).
0.20/0.49	thf(c_0_16, negated_conjecture, ![X2:$i, X1:$i]:((((dsetconstr @ X1 @ (^[Z0/* 3 */:$i]:(((Z0)=(X2)))))=(setadjoin @ X2 @ emptyset))|~((in @ X2 @ X1)))), inference(condense,[status(thm)],[c_0_14])).
0.20/0.49	thf(c_0_17, negated_conjecture, ![X1:$i, X4:$i, X2:$i]:(((in @ X4 @ (dsetconstr @ X2 @ (^[Z0/* 9 */:$i]:(((~($true)&((Z0)=(X1)))|(~(~($true))&((Z0)=(X4))))))))|~((in @ X1 @ X2))|~((in @ X4 @ X2)))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_12])])])).
0.20/0.49	thf(c_0_18, plain, ![X1:$i, X2:$i]:((((dsetconstr @ esk1_0 @ (^[Z0/* 9 */:$i]:(((~((epred1_0))&((Z0)=(esk3_0)))|(((Z0)=(esk2_0))&(epred1_0))))))!=(setadjoin @ X1 @ emptyset))|((^[Z0/* 9 */:$i]:(((~((epred1_0))&((Z0)=(esk3_0)))|(((Z0)=(esk2_0))&(epred1_0)))))!=(^[Z0/* 3 */:$i]:(((Z0)=(X2)))))|~((in @ X1 @ (setadjoin @ X2 @ emptyset)))|~((in @ X2 @ esk1_0)))), inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_15, c_0_16])])).
0.20/0.49	thf(c_0_19, negated_conjecture, ![X1:$i, X4:$i, X2:$i]:(((in @ X1 @ (dsetconstr @ X2 @ (^[Z0/* 3 */:$i]:(((Z0)=(X1))))))|~((in @ X1 @ X2))|~((in @ X4 @ X2)))), inference(cn,[status(thm)],[c_0_17])).
0.20/0.49	thf(c_0_20, negated_conjecture, (in @ esk2_0 @ esk1_0), inference(split_conjunct,[status(thm)],[c_0_12])).
0.20/0.49	thf(c_0_21, plain, ![X1:$i, X2:$i]:((((dsetconstr @ esk1_0 @ (^[Z0/* 9 */:$i]:(((~((epred1_0))&((Z0)=(esk3_0)))|(((Z0)=(esk2_0))&(epred1_0))))))!=(setadjoin @ X1 @ emptyset))|(((~((epred1_0))&((esk8_1 @ X2)=(esk3_0)))|(((esk8_1 @ X2)=(esk2_0))&(epred1_0)))<~>((esk8_1 @ X2)=(X2)))|~((in @ X1 @ (setadjoin @ X2 @ emptyset)))|~((in @ X2 @ esk1_0)))), inference(neg_ext,[status(thm)],[c_0_18])).
0.20/0.49	thf(c_0_22, negated_conjecture, ![X1:$i, X2:$i]:(((in @ X1 @ (dsetconstr @ X2 @ (^[Z0/* 3 */:$i]:(((Z0)=(X1))))))|~((in @ X1 @ X2)))), inference(condense,[status(thm)],[c_0_19])).
0.20/0.49	thf(c_0_23, negated_conjecture, ((dsetconstr @ esk1_0 @ (^[Z0/* 3 */:$i]:(((Z0)=(esk2_0)))))=(setadjoin @ esk2_0 @ emptyset)), inference(spm,[status(thm)],[c_0_16, c_0_20])).
0.20/0.49	thf(c_0_24, negated_conjecture, (in @ esk3_0 @ esk1_0), inference(split_conjunct,[status(thm)],[c_0_12])).
0.20/0.49	thf(c_0_25, plain, ![X1:$i, X2:$i]:((((dsetconstr @ esk1_0 @ (^[Z0/* 3 */:$i]:(((Z0)=(esk2_0)))))!=(setadjoin @ X1 @ emptyset))|((esk8_1 @ X2)!=(esk2_0))|((esk8_1 @ X2)!=(X2))|~((in @ X1 @ (setadjoin @ X2 @ emptyset)))|~((in @ X2 @ esk1_0))|~((epred1_0)))), inference(cn,[status(thm)],[inference(local_rw,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_21])])])).
0.20/0.49	thf(c_0_26, negated_conjecture, (in @ esk2_0 @ (setadjoin @ esk2_0 @ emptyset)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_20])])).
0.20/0.49	thf(c_0_27, negated_conjecture, ((dsetconstr @ esk1_0 @ (^[Z0/* 3 */:$i]:(((Z0)=(esk3_0)))))=(setadjoin @ esk3_0 @ emptyset)), inference(spm,[status(thm)],[c_0_16, c_0_24])).
0.20/0.49	thf(c_0_28, plain, ![X2:$i, X1:$i]:((((esk8_1 @ X1)=(esk2_0))|((esk8_1 @ X1)=(X1))|((dsetconstr @ esk1_0 @ (^[Z0/* 3 */:$i]:(((Z0)=(esk2_0)))))!=(setadjoin @ X2 @ emptyset))|~((in @ X2 @ (setadjoin @ X1 @ emptyset)))|~((in @ X1 @ esk1_0))|~((epred1_0)))), inference(cn,[status(thm)],[inference(local_rw,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_21])])])).
0.20/0.49	thf(c_0_29, negated_conjecture, (((esk8_1 @ esk2_0)!=(esk2_0))|~((epred1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_23]), c_0_20])])).
0.20/0.49	thf(c_0_30, plain, ![X1:$i, X2:$i]:(((epred1_0)|((dsetconstr @ esk1_0 @ (^[Z0/* 3 */:$i]:(((Z0)=(esk3_0)))))!=(setadjoin @ X1 @ emptyset))|((esk8_1 @ X2)!=(esk3_0))|((esk8_1 @ X2)!=(X2))|~((in @ X1 @ (setadjoin @ X2 @ emptyset)))|~((in @ X2 @ esk1_0)))), inference(cn,[status(thm)],[inference(local_rw,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_21])])])).
0.20/0.49	thf(c_0_31, negated_conjecture, (in @ esk3_0 @ (setadjoin @ esk3_0 @ emptyset)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_27]), c_0_24])])).
0.20/0.49	thf(c_0_32, plain, ![X2:$i, X1:$i]:((((esk8_1 @ X1)=(esk3_0))|((esk8_1 @ X1)=(X1))|(epred1_0)|((dsetconstr @ esk1_0 @ (^[Z0/* 3 */:$i]:(((Z0)=(esk3_0)))))!=(setadjoin @ X2 @ emptyset))|~((in @ X2 @ (setadjoin @ X1 @ emptyset)))|~((in @ X1 @ esk1_0)))), inference(cn,[status(thm)],[inference(local_rw,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_21])])])).
0.20/0.49	thf(c_0_33, negated_conjecture, ~((epred1_0)), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_26]), c_0_23]), c_0_20])]), c_0_29])).
0.20/0.49	thf(c_0_34, negated_conjecture, ((epred1_0)|((esk8_1 @ esk3_0)!=(esk3_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_27]), c_0_24])])).
0.20/0.49	thf(c_0_35, negated_conjecture, ((esk8_1 @ esk3_0)=(esk3_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_31]), c_0_27]), c_0_24])]), c_0_33])).
0.20/0.49	thf(c_0_36, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34, c_0_35])]), c_0_33]), ['proof']).
0.20/0.49	# SZS output end CNFRefutation
0.20/0.49	# Parsed axioms                        : 15
0.20/0.49	# Removed by relevancy pruning/SinE    : 9
0.20/0.49	# Initial clauses                      : 7
0.20/0.49	# Removed in clause preprocessing      : 0
0.20/0.49	# Initial clauses in saturation        : 7
0.20/0.49	# Processed clauses                    : 59
0.20/0.49	# ...of these trivial                  : 5
0.20/0.49	# ...subsumed                          : 1
0.20/0.49	# ...remaining for further processing  : 53
0.20/0.49	# Other redundant clauses eliminated   : 6
0.20/0.49	# Clauses deleted for lack of memory   : 0
0.20/0.49	# Backward-subsumed                    : 9
0.20/0.49	# Backward-rewritten                   : 2
0.20/0.49	# Generated clauses                    : 121
0.20/0.49	# ...of the previous two non-redundant : 106
0.20/0.49	# ...aggressively subsumed             : 0
0.20/0.49	# Contextual simplify-reflections      : 3
0.20/0.49	# Paramodulations                      : 82
0.20/0.49	# Factorizations                       : 0
0.20/0.49	# NegExts                              : 5
0.20/0.49	# Equation resolutions                 : 7
0.20/0.49	# Total rewrite steps                  : 54
0.20/0.49	# Propositional unsat checks           : 0
0.20/0.49	#    Propositional check models        : 0
0.20/0.49	#    Propositional check unsatisfiable : 0
0.20/0.49	#    Propositional clauses             : 0
0.20/0.49	#    Propositional clauses after purity: 0
0.20/0.49	#    Propositional unsat core size     : 0
0.20/0.49	#    Propositional preprocessing time  : 0.000
0.20/0.49	#    Propositional encoding time       : 0.000
0.20/0.49	#    Propositional solver time         : 0.000
0.20/0.49	#    Success case prop preproc time    : 0.000
0.20/0.49	#    Success case prop encoding time   : 0.000
0.20/0.49	#    Success case prop solver time     : 0.000
0.20/0.49	# Current number of processed clauses  : 32
0.20/0.49	#    Positive orientable unit clauses  : 9
0.20/0.49	#    Positive unorientable unit clauses: 0
0.20/0.49	#    Negative unit clauses             : 1
0.20/0.49	#    Non-unit-clauses                  : 22
0.20/0.49	# Current number of unprocessed clauses: 57
0.20/0.49	# ...number of literals in the above   : 274
0.20/0.49	# Current number of archived formulas  : 0
0.20/0.49	# Current number of archived clauses   : 21
0.20/0.49	# Clause-clause subsumption calls (NU) : 134
0.20/0.49	# Rec. Clause-clause subsumption calls : 20
0.20/0.49	# Non-unit clause-clause subsumptions  : 7
0.20/0.49	# Unit Clause-clause subsumption calls : 37
0.20/0.49	# Rewrite failures with RHS unbound    : 0
0.20/0.49	# BW rewrite match attempts            : 1
0.20/0.49	# BW rewrite match successes           : 1
0.20/0.49	# Condensation attempts                : 59
0.20/0.49	# Condensation successes               : 2
0.20/0.49	# Termbank termtop insertions          : 11486
0.20/0.49	
0.20/0.49	# -------------------------------------------------
0.20/0.49	# User time                : 0.010 s
0.20/0.49	# System time              : 0.009 s
0.20/0.49	# Total time               : 0.019 s
0.20/0.49	# Maximum resident set size: 2028 pages
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.051 s
0.20/0.50	# System time              : 0.016 s
0.20/0.50	# Total time               : 0.067 s
0.20/0.50	# Maximum resident set size: 1716 pages
0.20/0.50	% E---3.1 exiting
0.20/0.50	EOF